ProofFlow: Flow Diagrams for Proofs

نویسنده

  • Steven A. Kieffer
چکیده

We present a light formalism for proofs that encodes their inferential structure, along with a system that transforms these representations into flow-chart diagrams. Such diagrams should improve the comprehensibility of proofs. We discuss language syntax, diagram semantics, and our goal of building a repository of diagrammatic representations of proofs from canonical mathematical literature. The repository will be available online in the form of a wiki at proofflow.org, where the flow chart drawing software will be deployable through the wiki editor. We also consider the possibility of a semantic tagging of the assertions in a proof, to permit data mining.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Availability Semantics of Predicate Data Flow Diagram

The core of the SOZL(structured methodology + object-oriented methodology + Z language) is Predicate Data Flow Diagram. In order to eliminate the ambiguity of predicate data flow diagrams and their associated textual specifications, a formalization of the syntax and semantics of predicate data flow diagrams are necessary. In this paper we use Z notation to define an abstract syntax and the rela...

متن کامل

On the relative proof complexity of deep inference via atomic flows

Abstract. We consider the proof complexity of the minimal complete fragment, KS, of standard deep inference systems for propositional logic. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore logical information. As results we obtain a polynomial simulation of versions of Resolution, along with some extensions. We also show th...

متن کامل

Some Results on the Relative Proof Complexity of Deep Inference via Atomic Flows

Abstract. We consider the proof complexity of the minimal complete fragment of standard deep inference, denoted KS. To examine the size of proofs we employ atomic flows, diagrams that trace structural changes through a proof but ignore logical information. As results we obtain a polynomial simulation of dag-like cut-free Gentzen and Resolution, along with some extensions. We also show that thes...

متن کامل

Proof Theory for Reasoning with Euler Diagrams: A Logic Translation and Normalization

Proof-theoretical notions and techniques, which are developed based on sentential/symbolic representations of formal proofs, are applied to Euler diagrams. A translation of an Euler diagrammatic system into a natural deduction system is given, and the soundness and faithfulness of the translation are proved. Some consequences of the translation are discussed in view of the notion of free ride, ...

متن کامل

On Automating Diagrammatic Proofs of Arithmetic Arguments

Theorems in automated theorem proving are usually proved by formal logical proofs. However, there is a subset of problems which humans can prove by the use of geometric operations on diagrams, so called diagrammatic proofs. Insight is often more clearly perceived in these proofs than in the corresponding algebraic proofs; they capture an intuitive notion of truthfulness that humans find easy to...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1202.0567  شماره 

صفحات  -

تاریخ انتشار 2012